Removing circuits in 3-connected binary matroids

نویسندگان

  • Raul Cordovil
  • Braulio Maia
  • Manoel Lemos
چکیده

For a k-connected graph or matroid M , where k is a fixed positive integer, we say that a subset X of E(M) is k-removable provided M\X is k-connected. In this paper, we obtain a sharp condition on the size of a 3connected binary matroid to have a 3-removable circuit.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the circuit-spectrum of binary matroids

Murty, in 1971, characterized the connected binary matroids with all circuits having the same size. We characterize the connected binary matroids with circuits of two different sizes, where the largest size is odd. As a consequence of this result we obtain both Murty’s result and other results on binary matroids with circuits of only two sizes. We also show that it will be difficult to complete...

متن کامل

Towards a Splitter Theorem for Internally 4-connected Binary Matroids Vii

Let M be a 3-connected binary matroid; M is internally 4connected if one side of every 3-separation is a triangle or a triad, and M is (4, 4, S)-connected if one side of every 3-separation is a triangle, a triad, or a 4-element fan. Assume M is internally 4-connected and that neither M nor its dual is a cubic Möbius or planar ladder or a certain coextension thereof. Let N be an internally 4-con...

متن کامل

Removable Circuits in Binary Matroids

We show that if M is a connected binary matroid of cogirth at least ve which does not have both an F 7-minor and an F 7-minor, then M has a circuit C such that M ? C is connected and r(M ? C) = r(M).

متن کامل

The 3-connected Binary Matroids with Circumference

In this paper, we construct all 3-connected binary matroids with circumference equal to 6 or 7 having large rank.

متن کامل

The 3-connected binary matroids with circumference 6 or 7

In this paper, we construct all 3-connected binary matroids with circumference equal to 6 or 7 having large rank. © 2008 Elsevier Ltd. All rights reserved.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Mathematics

دوره 309  شماره 

صفحات  -

تاریخ انتشار 2009